induced isomorphism

См. также в других словарях:

• Induced subgraph isomorphism problem — In complexity theory and graph theory, induced subgraph isomorphism is an NP complete decision problem that involves finding a given graph as an induced subgraph of a larger graph.Formally, the problem takes as input two graphs G 1=( V 1, E 1)… …   Wikipedia

• Induced homomorphism (fundamental group) — In mathematics, especially in the area of topology known as algebraic topology, the induced homomorphism is a group homomorphism related to the study of the fundamental group.DefinitionLet X and Y be topological spaces; let x 0 be a point of X… …   Wikipedia

• Induced representation — In mathematics, and in particular group representation theory, the induced representation is one of the major general operations for passing from a representation of a subgroup H to a representation of the (whole) group G itself. It was initially …   Wikipedia

• Maximum common subgraph isomorphism problem — In complexity theory, maximum common subgraph isomorphism (MCS) is an optimization problem that is known to be NP hard. The formal description of the problem is as follows: Maximum common subgraph isomorphism(G1, G2) Input: Two graphs G1 and G2.… …   Wikipedia

• Subgraph isomorphism problem — In complexity theory, Subgraph Isomorphism is a decision problem that is known to be NP complete. The formal description of the decision problem is as follows.Subgraph Isomorphism(G1, G2) Input: Two graphs G1 and G2. Question: Is G1 isomorphic to …   Wikipedia

• Uniform isomorphism — In the mathematical field of topology a uniform isomorphism or uniform homeomorphism is a special isomorphism between uniform spaces which respects uniform properties. DefinitionA function f between two uniform spaces X and Y is called a uniform… …   Wikipedia

• Quasi-isomorphism — In homological algebra, a branch of mathematics, a quasi isomorphism is a morphism A → B of chain complexes (respectively, cochain complexes) such that the induced morphisms :H n(A ullet) o H n(B ullet) ( ext{respectively, } H^n(A^ullet) o… …   Wikipedia

• Metric tensor — In the mathematical field of differential geometry, a metric tensor is a type of function defined on a manifold (such as a surface in space) which takes as input a pair of tangent vectors v and w and produces a real number (scalar) g(v,w) in a… …   Wikipedia

• List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… …   Wikipedia

• Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… …   Wikipedia

• Clifford algebra — In mathematics, Clifford algebras are a type of associative algebra. They can be thought of as one of the possible generalizations of the complex numbers and quaternions.[1][2] The theory of Clifford algebras is intimately connected with the… …   Wikipedia